De-aliasing on non-uniform grids: algorithms and applications

نویسندگان

  • Robert M. Kirby
  • George Em Karniadakis
چکیده

We present de-aliasing rules to be used when evaluating non-linear terms with polynomial spectral methods on nonuniform grids analogous to the de-aliasing rules used in Fourier spectral methods. They are based upon the idea of super-collocation followed by a Galerkin projection of the non-linear terms. We demonstrate through numerical simulation that both accuracy and stability can be greatly enhanced through the use of this approach. We begin by deriving from the numerical quadrature rules used by Galerkin-type projection methods the number of quadrature points and weights needed for quadratic and cubic non-linearities. We then present a systematic study of the effects of supercollocation when using both a continuous Galerkin and a discontinuous Galerkin method to solve the one-dimensional viscous Burgers equation. We conclude by examining three direct numerical simulation flow examples: incompressible turbulent flow in a triangular duct, incompressible turbulent flow in a channel at Res 1⁄4 395, and compressible flow past a pitching airfoil at Re 1⁄4 45,000. 2003 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finite-Grid Instability in Non-Uniform Grids

The use of a discretization grid in particle-in-cell methods is responsible for the nite-grid instability. The instability is a spurious numerical e ect due to the aliasing of di erent Fourier modes, that are undistinguished by the computational grid but have di erent e ects on the particles. The nite-grid instability has been studied thoroughly in uniform grids [1, 2]; a linear theory has been...

متن کامل

Multi-resolution unstructured grid-generation for geophysical applications on the sphere

An algorithm for the generation of non-uniform unstructured grids on ellipsoidal geometries is described. This technique is designed to generate high quality triangular and polygonal meshes appropriate for general circulation modelling on the sphere, including applications to atmospheric and ocean simulation, and numerical weather predication. Using a recently developed Frontal-Delaunay-refinem...

متن کامل

Improvement of Support Vector Machine and Random Forest Algorithm in Predicting Khorramabad River Flow Uusing Non-uniform De-Noising of data and Simplex Algorithm

In this study, in order to simulate the monthly flow of the Khorramabad River, the time series of this river was decomposed into three levels using the wavelet of Daubechies-3, during the period of 1955-2014. Based on this, it was found that there is a Non-uniform noise that includes two periods of time in this signal, with the October 2008 border which required that the signal be become non-un...

متن کامل

Real-Time Acoustics Simulation using Mesh-Tracing

A number of techniques have been presented recently to simulate or predict the acoustics of a room. Among these we can find reverberation algorithms based on waveguide meshes and acoustic ray-tracing. Both approaches have disadvantages, such as an excessive amount of computation required (resulting in only off-line simulations) or aliasing phenomena caused by non-uniform speed of sound distribu...

متن کامل

Sparse Fast Fourier Transform for Exactly and Generally K-Sparse Signals by Downsampling and Sparse Recovery

Fast Fourier Transform (FFT) is one of the most important tools in digital signal processing. FFT costs O(N logN) for transforming a signal of length N . Recently, researchers at MIT have proposed Sparse Fast Fourier Transform (sFFT) [1][2] as a breakthrough with computational complexity O(K logN) and O(K logN log N K ) for exactly K-sparse signal (with only K non-zero frequency grids) and gene...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003